MacKE: Yet Another Proof Assistant & Automated Pedagogic Tool
نویسنده
چکیده
In this paper, we describe the implementation of (yet another) proof assistant and/or automated pedagogic tool. This one is based on the calculus KE and our Prolog implementation of free variable KE. The new system is written in LPA MacProlog TM , and features an interactive interface via menus, dialogues and graphics tools, a graphics window for constructing and displaying proofs, and on-and oo-line proof checking. The ease of use and the visual satisfaction of the interface should make the system very convenient for fulllling its primary intended function: teaching logic and reasoning through KE.
منابع مشابه
Automating the Verification of Floating-Point Algorithms
Floating-point numbers are limited both in range and in precision, yet they are widely used as a way to implement computations on real numbers. Thus arithmetic operations introduce small errors which might be amplified during subsequent computations and cause inaccuracies. As such, proving the correctness of a floating-point algorithm usually entails verifying that the computed results are stil...
متن کاملAutomated verification of termination certificates
In order to increase user confidence, many automated theorem provers provide certificates that can be independently verified. In this paper, we report on our progress in developing a standalone tool for checking the correctness of certificates for the termination of term rewrite systems, and formally proving its correctness in the proof assistant Coq. To this end, we use the extraction mechanis...
متن کاملTool Presentation: Isabelle/HOL for Reachability Analysis of Continuous Systems
We present a tool for reachability analysis of continuous systems based on affine arithmetic and Runge-Kutta methods. The distinctive feature of our tool is its verification in the interactive theorem prover Isabelle/HOL: the algorithm is guaranteed to compute safe overapproximations, taking into account all round-off and discretization errors.
متن کاملSystem for Automated Deduction (SAD): A Tool for Proof Verification
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given) and checks their correctness. We give a short description of SAD and a series of examples that show what can be done with it. Note that abstract notion of correctness on which the implementation is based, can be form...
متن کاملSEPIA: Search for Proofs Using Inferred Automata
This paper describes SEPIA, a tool for automated proof generation in Coq. SEPIA combines model inference with interactive theorem proving. Existing proof corpora are modelled using state-based models inferred from tactic sequences. These can then be traversed automatically to identify proofs. The SEPIA system is described and its performance evaluated on three Coq datasets. Our results show tha...
متن کامل